Formalising Sylow's theorems in Coq

نویسنده

  • Laurent Théry
چکیده

This report presents a formalisation of Sylow’s theorems done in Coq. The formalisation has been done in a couple of weeks on top of Georges Gonthier’s ssreflect [2]. There were two ideas behind formalising Sylow’s theorems. The first one was to get familiar with Georges way of doing proofs. The second one was to contribute to the collective effort to formalise a large subset of group theory in Coq with some non-trivial proofs. Key-words: Group theory, Sylow’s theorems, Formalisation of mathematics Formalisation des théorèmes de Sylow dans Coq Résumé : Ce rapport présente une formalisation des théorèmes de Sylow faite dans le système Coq. La formalisation s’est faite en deux semaines au dessus de la librairie ssreflect de Georges Gonthier. Il y avait deux principales motivations pour formaliser les théorèmes de Sylow. La première était de se familiariser avec la façon qu’a Georges de faire des preuves. La seconde était de contribuer à l’effort collectif de formaliser un large ensemble de la théorie des groupes en Coq. Mots-clés : Théorie des groupes, Théorème de Sylow, Formalisation des mathématiques

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Short Introduction by Example to Coq and Formalising ZF ⊆ ZFε in Coq

Proof assistants are computer programs that help mathematicians to prove theorems and to formally verify the correctness of proofs. Proof assistants are nowadays one of the more exciting areas in the intersection of mathematical logic and computer science. For example, one particularly exciting achievement is the formal verification of the proof of the four colour theorem using the proof assist...

متن کامل

Formalising LPOs and Invariants in Coq

In the setting of CRL the notions of linear process operator LPO and invariant are implemented in Coq which is a a proof development tool based on type theory As a rst experiment we have computer checked a general property of a binary search program in the new framework

متن کامل

An Efficient Coq Tactic for Deciding Kleene Algebras

We present a reflexive tactic for deciding the equational theory of Kleene algebras in the Coq proof assistant. This tactic relies on a careful implementation of efficient finite automata algorithms, so that it solves casual equations almost instantaneously. The corresponding decision procedure was proved correct and complete; correctness is established w.r.t. any model (including binary relati...

متن کامل

A Formal Proof of Sylow's Theorem An Experiment in Abstract Algebra with Isabelle HOL

The theorem of Sylow is proved in Isabelle HOL. We follow the proof by Wielandt that is more general than the original and uses a non-trivial combinatorial identity. The mathematical proof is explained in some detail leading on to the mechanization of group theory and the necessary combinatorics in Isabelle. We present the mechanization of the proof in detail giving reference to theorems contai...

متن کامل

QArith: Coq Formalisation of Lazy Rational Arithmetic

In this paper we present the Coq formalisation of the QArith library which is an implementation of rational numbers as binary sequences for both lazy and strict computation. We use the representation also known as the Stern-Brocot representation for rational numbers. This formalisation uses advanced machinery of the Coq theorem prover and applies recent developments in formalising general recur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/cs/0611057  شماره 

صفحات  -

تاریخ انتشار 2006